Nearly Optimal Language Compression Using Extractors
نویسندگان
چکیده
We show two sets of results applying the theory of extractors to resource-bounded Kolmogorov complexity: Most strings in easy sets have nearly optimal polynomial-time CD complexity. This extends work of Sipser Sip83] and Buhrman and Fortnow BF97]. We use extractors to extract the randomness of strings. In particular we show how to get from an arbitrary string, an incompressible string which encodes almost as much polynomial-time CND complexity as the original string.
منابع مشابه
Intelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کاملFeature Extraction (Image Compression) of Printed Gujarati and Amharic Letters Using Discrete Wavelet Transform
This paper demonstrates an application of discrete wavelet transform as a feature extractor as applicable to natural language processing. The procedure discussed in this paper extracts important features of the printed characters of Gujarati and Amharic scripts and shows Image compression capabilities of discrete wavelets. Procedure prescribed in this paper compresses the original image to 75% ...
متن کاملRandomness extractors -- applications and constructions
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for constructing extractors, these constructions turn out to have strong pseudorandom properties which found applications in diverse areas of computer science and combinatorics. We will highlight some of the applications, as...
متن کاملAn E icient Reduction from Two-Source to Non-malleable Extractors
The breakthrough result of Chattopadhyay and Zuckerman (2016) gives a reduction from the construction of explicit two-source extractors to the construction of explicit non-malleable extractors. However, even assuming the existence of optimal explicit nonmalleable extractors only gives a two-source extractor (or a Ramsey graph) for poly(logn) entropy, rather than the optimal O (logn). In this pa...
متن کاملRecent Advances in Complexity Theory
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractors, thismatches the parameters of the current best known construction [LRV03]; for lossless condensers,the previous best constructions achieved optimality to within a constant factor in one parameteronly at ...
متن کامل